Approximate planning

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate Planning

This paper makes two linked contributions. First, we argue that p]ann;ng systems, instead of being correct (every plan returned achieves the goal) and complete (all such plans are returned), should be app~zimately correct and complete, in that most plans returned achieve the goal and that most such plans are returned. Our first contribution is to formalize this notion. Our second aim is to demo...

متن کامل

Interplay of approximate planning strategies.

Humans routinely formulate plans in domains so complex that even the most powerful computers are taxed. To do so, they seem to avail themselves of many strategies and heuristics that efficiently simplify, approximate, and hierarchically decompose hard tasks into simpler subtasks. Theoretical and cognitive research has revealed several such strategies; however, little is known about their establ...

متن کامل

A-Learning for Approximate Planning

Abstract We consider a new algorithm for reinforcement learning called A-learning. A-learning learns the advantages from a single training set. We compare A-learning with function approximation to Q-learning with function approximation and find that because A-learning approximates only the advantages it is less likely to exhibit bias due to the function approximation as compared to Q-learning.W...

متن کامل

Approximate Planning for Factored POMDPs

We describe an approximate dynamic programming algorithm for partially observable Markov decision processes represented in factored form. Two complementary forms of approximation are used to simplify a piecewise linear and convex value function, where each linear facet of the function is represented compactly by an algebraic decision diagram. ln one form of approximation, the degree of state ab...

متن کامل

Approximate Planning in the Probabilistic-Planning-as-Stochastic-Satisfiability Paradigm

zander is a state-of-the-art probabilistic planner that extends the probabilistic-planning-as-stochastic-satisfiability paradigm to support contingent planning in domains where there is uncertainty in the effects of the agent’s actions and where the scope and accuracy of the agent’s observations may be insufficient to establish the agent’s current state with certainty (Majercik & Littman 1999)....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Artificial Intelligence

سال: 1995

ISSN: 0004-3702

DOI: 10.1016/0004-3702(94)00077-e